Distributed PROMPT-LTL Synthesis

Distributed PROMPT-LTL Synthesis

We consider the synthesis of distributed implementations for specifications in Prompt Linear Temporal Logic (PROMPT–LTL), which extends LTL by temporal operators equipped with parameters that bound their scope. For single process synthesis it is well-established that such parametric extensions do not increase worst-case complexities. For synchronous systems, we show that, despite being more pow...

CTL* synthesis via LTL synthesis

We reduce synthesis for CTL∗ properties to synthesis for LTL. In the context of model checking this is impossible — CTL∗ is more expressive than LTL. Yet, in synthesis we have knowledge of the system structure and we can add new outputs. These outputs can be used to encode witnesses of the satisfaction of CTL∗ subformulas directly into the system. This way, we construct an LTL formula, over old...

ACTL ∩ LTL Synthesis

We study the synthesis problem for specifications of the common fragment of ACTL (computation tree logic with only universal path quantification) and LTL (linear-time temporal logic). Key to this setting is a novel construction for translating properties from LTL to very-weak automata, whenever possible. Such automata are structurally simple and thus amenable to optimizations as well as symboli...

Compositional Algorithms for LTL Synthesis

In this paper, we provide two compositional algorithms to solve safety games and apply them to provide compositional algorithms for the LTL synthesis problem. We have implemented those new compositional algorithms, and we demonstrate that they are able to handle full LTL specifications that are orders of magnitude larger than the specifications that can be treated by the current state of the ar...

Distributed LTL Model-Checking in SPIN